Tree embeddings and tree‐star Ramsey numbers
نویسندگان
چکیده
Abstract We say that a graph can be embedded into if contains an isomorphic copy of as subgraph. Guo and Volkmann conjectured is connected with at least vertices minimum degree , then any tree maximum most . In this paper, we give result slightly stronger than conjecture obtain sufficient necessary condition G Our implies the true one exception. also application to Ramsey number versus star.
منابع مشابه
Tree-Ramsey numbers
We denote by r'( G I , G2 ) the ramsey number of two graphs and G2 • If Tp+l is a tree of order p + 1 which is not a star, and if jJ is not a divisor of the positive integer q 1, then we shall show that r(Tp+b ](l,q) ::; p + q 1, and we shall describe some trees and stars for which equality holds. Furthermore. we detf'rmine the ramsey numbers r(T;+l' Tq*+l) for p, q ~ 4, where T~ denotes a tree...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملExtremal theory and bipartite graph-tree Ramsey numbers
For a positive integer n and graph B, fa (n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and i (k-1), then there exists a positive constant c, such that for any tree T of order n and for any j (0-j _-(k-1)), the Ramsey number r(T, B) < n + c-(fe (n)) 't(k-1) if A(T)-(n/(k-j-1))-(...
متن کاملMonochromatic tree covers and Ramsey numbers for set-coloured graphs
We extend results on monochromatic tree covers and from classical Ramsey theory to a generalised setting, where each of the edges of an underlying host graph (here, either a complete graph or a complete bipartite graph), is coloured with a set of colours. Our results for tree covers in this setting have an application to Ryser’s Conjecture. Every r-partite r-uniform hypergraph whose edges pairw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22806